Dynamic stochastic electric vehicle routing with safe reinforcement learning

نویسندگان

چکیده

Dynamic routing of electric commercial vehicles can be a challenging problem since besides the uncertainty energy consumption there are also random customer requests. This paper introduces Stochastic Electric Vehicle Routing Problem (DS-EVRP). A Safe Reinforcement Learning method is proposed for solving problem. The objective to minimize expected in safe way, which means minimizing risk battery depletion while en route by planning charging whenever necessary. key idea learn offline about stochastic requests and using Monte Carlo simulations, able plan predictively safely online. evaluated simulations based on data from realistic traffic model city Luxembourg high-fidelity vehicle model. results indicate that it possible save at same time maintaining reliability routes an anticipative way. has potential improve transport operations with capitalizing their environmental benefits.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Vehicle Routing with Stochastic Requests

This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It proposes a multiple scenario approach (MSA) that continuously generates plans consistent with past decisions and anticipating future requests. The approach, which combines AI and OR techniques in novel ways, is compared with ...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

A dynamic scheme for stochastic vehicle routing

This paper considers stochastic load-constrained vehicle routing systems in which a fleet of homogeneous vehicles is dispatched from a central depot to serve the demands of surrounding customers. Customer locations and load sizes are known only in distribution before operations. Variants of this problem are often treated with very simple uncoordinated operating schemes, which are mathematically...

متن کامل

Dynamic Vehicle Routing with Priority Classes of Stochastic Demands

In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Part E-logistics and Transportation Review

سال: 2022

ISSN: ['1366-5545', '1878-5794']

DOI: https://doi.org/10.1016/j.tre.2021.102496